Genetic Algorithm for Solving Berth and Quay Cranes Assignment problems

The management of a container terminal is a complex process that involves a vast number of decisions. The berth is the most important resource that affects the capacity of the terminal. The problem is here to allocate berths to arriving vessels and to determine which cranes in the berths process the docked vessels. For creating the berth schedule, the calling schedule of vessels, favourable berthing location (near primary storage, for example) and the number of available cranes can be considered simultaneously. This paper discusses an optimization technique for scheduling Berth and Quay cranes using genetic algorithm (GA). Genetic Algorithms are useful for finding near-optimal solutions. GA requires non-trivial time, but hopefully will search a wider part of the solution space. The objective is to reduce the total stay or delay times of vessels at a port i.e. the waiting, loading and discharging of containers should be done as quickly as possible, in order to save on terminal costs. 2 International Conference on Ports and Waterways – POWA 2007